Register Allocation Using Circular Fifos
نویسندگان
چکیده
In this paper, we study the memory allocation problem in data path synthesis. We propose a register organization called circular FIFO as an alternative to register file organization. In comparison with register file organization, FIFO organization eliminates the overhead of address generation and decoding hardware. The memory allocation problem, based on the circular FIFO organization, has been solved efficiently using constraint logic and interval constraint programming.
منابع مشابه
On a Graph-theoretical Model for Cyclic Register Allocation
In the process of compiling a computer programme, we consider the problem of allocating variables to registers within a loop. It can be formulated as a coloring problem in a circular arc graph (intersection graph of a family F of intervals on a circle). We consider the meeting graph of F introduced by Eisenbeis, Lelait and Marmol. Proceedings of the Fifth Workshop on Compilers for Parallel Comp...
متن کاملRegister Allocation After Classical SSA Elimination is NP-Complete
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference graph of a program in static single assignment (SSA) form is chordal and therefore colorable in linear time. Can we use the result of Bouchez et al. to do register allocation in polynomial time by first transforming the...
متن کاملUsing the Meeting Graph Framework to Minimise Kernel Loop Unrolling for Scheduled Loops
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular lifetime intervals are known. When loops are software pipelined, the number of values simultaneously alive becomes exactly known giving better opportunities for kernel loop unrolling. Furthermore, fixing circular life...
متن کاملBuffer allocation in regular dataflow networks: an approach based on coloring circular-arc graphs
In this paper we discuss a method to perform compile-time buffer allocation, allowing efficient buffer sharing among the arcs of a special form of dataflow graphs known as regular stream flow graphs commonly used in Digital Signal Processing applications. We relate the buffer sharing problem to that of finding independent sets in weighted circular arc graph. An important difference between the ...
متن کاملAn Approach Based on Coloring Circular-Arc Graphs
to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract In this paper we discuss a method to perform compile-time buuer allocation, allowing eecient buuer sharing among the arcs of a s...
متن کامل